Propositional dynamic logic of flowcharts

Propositional Dynamic Logic of Flowcharts

Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nondeterministic finite automata o~¢er atomic programs and tests (i.e., flowcharts), rather than regular expressions. While the resulting version of PDL, call it APDL, is clearly equivalent in expressive power to PDL, it is also (in the worst case) exponentially more succinct. In particular, deciding ...

Generalizing Propositional Dynamic Logic

A new semantics of Propositional Dynamic Logic (PDL) is given in terms of predicate transformers: Instead of associating the standard state transformer with each program, we model programs by operations on sets of states, operations which map postconditions to weakest liberal preconditions. This yields a logic more general than PDL since new program operations such as angelic choice become expr...

Dynamic Logic of Propositional Commitments

A number of systems of dynamic epistemic logic have been developed recently as extensions of static epistemic logic by Plaza [11], Gerbrandy & Groeneveld [5], Gerbrandy [4], Baltag, Moss & Solecki [2], and Kooi & van Benthem [7] among others.2 In these systems, dynamic changes brought about by various kinds of information transmission including public announcements as well as private communicat...

Propositional Dynamic Logic of Regular Programs

We introduce a fundamental propositional logical system based on modal logic for describing correctness, termination and equivalence of programs. We define a formal syntax and semantics for the propositional dynamic logic of regular programs and give several consequences of the definition. Principal conclusions are that deciding satisfiability of length n formulas requires time dn/lOgn for some...

Propositional Dynamic Logic of Nonregular Programs